By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 19, Issue 3, pp. 411-591

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Expressibility and Nonuniform Complexity Classes

B. Molzan

pp. 411-423

BibTeX  Abstract Full Text:  PDF

Deciding Equivalence of Finite Tree Automata

Helmut Seidl

pp. 424-437

BibTeX  Abstract Full Text:  PDF

A Nontrivial Lower Bound for an NP Problem on Automata

Etienne Grandjean

pp. 438-451

BibTeX  Abstract Full Text:  PDF

Multiplication of Polynomials over Finite Fields

Nader H. Bshouty and Michael Kaminski

pp. 452-456

BibTeX  Abstract Full Text:  PDF

A Class of Projective Transformations for Linear Programming

Yinyu Ye

pp. 457-466

BibTeX  Abstract Full Text:  PDF

Maximal Rank of $m\times n\times(mn-k)$ Tensors

Nader H. Bshouty

pp. 467-471

BibTeX  Abstract Full Text:  PDF

Flipping Persuasively in Constant Time

Cynthia Dwork, David Shmoys, and Larry Stockmeyer

pp. 472-499

BibTeX  Abstract Full Text:  PDF

Reset Sequences for Monotonic Automata

David Eppstein

pp. 500-510

BibTeX  Abstract Full Text:  PDF

Fast Simulations of Time-Bounded One-Tape Turing Machines by Space-Bounded Ones

Maciej Liskiewicz and Krzysztof Lorys

pp. 511-521

BibTeX  Abstract Full Text:  PDF

Unbounded Searching Algorithms

Richard Beigel

pp. 522-537

BibTeX  Abstract Full Text:  PDF

The Euclidean Algorithm and the Degree of the Gauss Map

Takis Sakkalis

pp. 538-543

BibTeX  Abstract Full Text:  PDF

Group Action Graphs and Parallel Architectures

Fred Annexstein, Marc Baumslag, and Arnold L. Rosenberg

pp. 544-569

BibTeX  Abstract Full Text:  PDF

Embedding Trees in a Hypercube is NP-Complete

A. Wagner and D. G. Corneil

pp. 570-590

BibTeX  Abstract Full Text:  PDF

Erratum: Weighted Leaf AVL-Trees

Vijay K. Vaishnavi

p. 591

BibTeX  Abstract Full Text:  PDF